: a hypothetical computing machine that by using only a limited set of very simple computational steps is able to perform any task for which an efficiently computable algorithm is known
Examples of Turing machine in a Sentence
Recent Examples on the Web
Universality and Task Robots Universality is essentially the idea that a Turing machine could complete the work of other Turing machines in a unified field theory of capability.
—
John Werner, Forbes, 24 Dec. 2024
The problem involves Turing machines, some of the simplest possible computing devices, first conceived by Alan Turing as a model for a general computer and now easily simulated online (opens a new tab).
—Bill Andrews, Quanta Magazine, 19 Dec. 2024
These states determine how the Turing machine acts with each input.
—Manon Bischoff, Scientific American, 25 July 2024
Sure, that leaves infinitely many such groups, since a Turing machine can have any number of rules.
—Ben Brubaker, Quanta Magazine, 2 July 2024
The field dates back to 1936, when Alan Turing first imagined a fanciful device, now called a Turing machine, that could perform any computation by reading and writing symbols on an infinite tape.
—Ben Brubaker, Quanta Magazine, 21 Mar. 2024
The hardware implementation of a Turing machine can be organized around a rule book and a notepad.
—IEEE Spectrum, 27 May 2023
Another notable and increasingly useful variant is the probabilistic Turing machine.
—Sheon Han, Quanta Magazine, 3 May 2023
The modern notion of an algorithm, known as a Turing machine, was formulated in 1936 by British mathematician Alan Turing.
—Jie Wang, Fortune, 30 Jan. 2023
Examples are automatically compiled from online sources to
show current usage.
Read More
Opinions expressed in the examples do not represent those of Merriam-Webster or its editors.
Send us feedback.
John Werner, Forbes, 24 Dec. 2024
The problem involves Turing machines, some of the simplest possible computing devices, first conceived by Alan Turing as a model for a general computer and now easily simulated online (opens a new tab).
—Bill Andrews, Quanta Magazine, 19 Dec. 2024
These states determine how the Turing machine acts with each input.
—Manon Bischoff, Scientific American, 25 July 2024
Sure, that leaves infinitely many such groups, since a Turing machine can have any number of rules.
—Ben Brubaker, Quanta Magazine, 2 July 2024
The field dates back to 1936, when Alan Turing first imagined a fanciful device, now called a Turing machine, that could perform any computation by reading and writing symbols on an infinite tape.
—Ben Brubaker, Quanta Magazine, 21 Mar. 2024
The hardware implementation of a Turing machine can be organized around a rule book and a notepad.
—IEEE Spectrum, 27 May 2023
Another notable and increasingly useful variant is the probabilistic Turing machine.
—Sheon Han, Quanta Magazine, 3 May 2023
The modern notion of an algorithm, known as a Turing machine, was formulated in 1936 by British mathematician Alan Turing.
—Jie Wang, Fortune, 30 Jan. 2023
Dictionary Entries Near Turing machine
Cite this Entry
“Turing machine.” Merriam-Webster.com Dictionary, Merriam-Webster, https://www.merriam-webster.com/dictionary/Turing%20machine. Accessed 8 Jan. 2025.
Copy CitationLove words? Need even more definitions?
Merriam-Webster unabridged
Share